A Fundamental Flaw in Incompleteness Proofs by Gregory Chaitin
نویسنده
چکیده
There are several similar proofs published by Chaitin involving the concept of information-theoretic complexity, and Chaitin claims that these are proof of the incompleteness of formal systems. An elementary analysis of these proofs demonstrates that the proofs are not in fact proofs of incompleteness.
منابع مشابه
Constructibility and Rosserizability of the Proofs of Boolos and Chaitin for Godel's Incompleteness Theorem
The proofs of Chaitin and Boolos for Gödel’s Incompleteness Theorem are studied from the perspectives of constructibility and Rosserizability. By Rosserization of a proof we mean that the independence of the true but unprovable sentence can be shown by assuming only the (simple) consistency of the theory. It is known that Gödel’s own proof for his incompleteness theorem is not Rosserizable, and...
متن کاملA Fundamental Flaw in an Incompleteness Proof by George Boolos
This paper addresses a proof of incompleteness published by George Boolos. An analysis of this proofs demonstrates that there is an elementary error in the proof; the proof relies on the unproven assumption that the formal system can selfreference its own formulas.
متن کاملThe Halting Probability Omega: Irreducible Complexity in Pure Mathematics∗
Some Gödel centenary reflections on whether incompleteness is really serious, and whether mathematics should be done somewhat differently, based on using algorithmic complexity measured in bits of information. Introduction: What is mathematics? It is a pleasure for me to be here today giving this talk in a lecture series in honor of Frederigo Enriques. Enriques was a great believer in mathemati...
متن کاملA new version of algorithmic information theory
Algorithmic information theory may be viewed as the result of adding the idea of program-size complexity to recursive function theory. The main application of algorithmic information theory is its informationtheoretic incompleteness theorems. This theory is concerned with the size of programs, but up to now these have never been programs that one could actually program out and run on interestin...
متن کاملChaitin Ω Numbers , Solovay Machines , and Incompleteness
Computably enumerable (c.e.) reals can be coded by Chaitin machines through their halting probabilities. Tuning Solovay’s construction of a Chaitin universal machine for which ZFC (if arithmetically sound) cannot determine any single bit of the binary expansion of its halting probability, we show that every c.e. random real is the halting probability of a universal Chaitin machine for which ZFC...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011